Trees with matrix weights: Laplacian matrix and characteristic-like vertices
نویسندگان
چکیده
It is known that there an alternative characterization of characteristic vertices for trees with positive weights on their edges via Perron values and branches. Moreover, the algebraic connectivity a tree edge can be expressed in terms value. In this article, we consider matrix edges. More precisely, are interested following classes weights: definite weights, lower (or upper) triangular diagonal entries.
منابع مشابه
Immanantal Polynomials of Laplacian Matrix of Trees
The immanant d () associated with the irreducible character of the symmetric group S n , indexed by the partition of n, acting on an nn matrix A = a ij ] is deened by d (A) = X 2Sn () n Y i=1 a ii(i) : For a tree T on n vertices, let L(T) denote its Laplacian matrix. Let x be an indeterminate variable and I be the n n identity matrix. The immanantal polynomial of T corresponding to d is deened ...
متن کاملComputing the additive degree-Kirchhoff index with the Laplacian matrix
For any simple connected undirected graph, it is well known that the Kirchhoff and multiplicative degree-Kirchhoff indices can be computed using the Laplacian matrix. We show that the same is true for the additive degree-Kirchhoff index and give a compact Matlab program that computes all three Kirchhoffian indices with the Laplacian matrix as the only input.
متن کاملOn the Laplacian Coefficients and Laplacian-Like Energy of Unicyclic Graphs with Vertices and Pendent Vertices
Copyright q 2012 X. Pai and S. Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Let Φ G, λ det λIn − L G ∑n k 0 −1 ck G λn−k be the characteristic polynomial of the Laplacian matrix of a graph G of order n. In this paper, we g...
متن کاملdeterminant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولProduct distance matrix of a tree with matrix weights
Let T be a tree on n vertices and let the n− 1 edges e1, e2, . . . , en−1 have weights that are s× s matrices W1,W2, . . . ,Wn−1, respectively. For two vertices i, j, let the unique ordered path between i and j be pi,j = er1er2 . . . erk . Define the distance between i and j as the s × s matrix Ei,j = ∏k p=1Wep . Consider the ns × ns matrix D whose i, j-th block is the matrix Ei,j . We give a f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2022
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2022.03.029